Solving Scheduling Problems with Setup Times and Alternative Resources

In this paper a general shop scheduling problem with sequence dependent setup times arid alternative r[.~ sources is considered, where optimization criteria are both makespan and sum of setup times. Two cooperative models for the problem based on Constraint Programming arc proposed. The first is used to model the scheduling constraints, while the second is a muhipath model used for setup optimization. I tegrating lower bounding techniques for the sum of setup times, the multi-path model perforins propagation based on reduced cost fixing. A solution method based on a two phase algorithm isdescribed, ,’rod a computationM study is performed both on instances known from literature as on newly proposed instances. Itis shown that the cooperation of the two models ignificantly improves performance. Although the aim of the paper is to study the problem including alternative resources, for several known instances without alternative resources, we were able to improve on the best known results.